Approximation algorithms

Results: 332



#Item
211Applied mathematics / Computational complexity theory / Algorithms / Streaming algorithm / Ε-net / Approximation algorithms / Computational geometry / Mathematics

Sketching, streaming, and sub-linear space algorithms Piotr Indyk MIT (currently at Rice U)

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2009-02-23 00:05:29
212Information retrieval / Locality-sensitive hashing / Hash function / Point location / N-sphere / Approximation algorithm / Nearest neighbor search / Search algorithms / Information science / Artificial intelligence

Optimal Data-Dependent Hashing for Approximate Near Neighbors Alexandr Andoni∗ † Ilya Razenshteyn∗ ‡ March 18, 2015

Add to Reading List

Source URL: www.ilyaraz.org

Language: English - Date: 2015-03-18 00:06:14
213Geometry / Discrete geometry / Approximation algorithms / Computational geometry / Information retrieval / Nearest neighbor search / Voronoi diagram / K-d tree / K-nearest neighbor algorithm / Information science / Mathematics / Search algorithms

Similarity Search in High Dimensions Piotr Indyk MIT Definitions

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2011-08-18 19:22:52
214Computational geometry / Geometry / Discrete geometry / Diagrams / Voronoi diagram / K-nearest neighbor algorithm / Approximation algorithms / Nearest neighbor search / Search algorithms / Mathematics / Information science

Microsoft PowerPoint - Low-distortion embeddinlgs and data structures

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2006-07-24 13:58:00
215Computational complexity theory / Complexity classes / Approximation algorithm / NP-complete / ACM SIGACT / European Symposium on Algorithms / International Colloquium on Automata /  Languages and Programming / Uriel Feige / Algorithm / Theoretical computer science / Applied mathematics / Computer science

Curriculum Vitae of Uriel Feige Contact Information Department of Computer Science and Applied Mathematics The Weizmann Institute of Science Rehovot 76100, ISRAEL Phones (office), (cell)

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2015-01-01 11:38:31
216Geometry / Discrete geometry / Computational geometry / Diagrams / Voronoi diagram / Approximation algorithms / Locality-sensitive hashing / K-d tree / K-nearest neighbor algorithm / Search algorithms / Information science / Mathematics

Microsoft PowerPoint - helsinki-1

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2007-08-11 15:06:22
217Topology / Abstract algebra / Functions and mappings / Differential topology / Travelling salesman problem / Embedding / Dimension / Isometry / Metric space / Mathematics / Geometry / Metric geometry

Approximation Algorithms for Bounded Dimensional Metric Spaces T.-H. Hubert Chan CMU-CSSeptember 2007

Add to Reading List

Source URL: i.cs.hku.hk

Language: English - Date: 2007-10-10 15:19:14
218Teletraffic / Theoretical computer science / Mathematics / Electronic engineering / Quality of service / Shortest path problem / Routing / Metrics / Adaptive quality of service multi-hop routing / Network performance / Streaming / Telecommunications engineering

Approximation Algorithms for QoS Routing with Multiple Additive Constraints Ronghui Hou, King-Shan Lui, Ka-Cheong Leung Fred Baker

Add to Reading List

Source URL: www.eee.hku.hk

Language: English - Date: 2012-06-13 00:42:16
219Expected value / Sequence

Polynomial-Time Approximation Algorithms for Weighted LCS Problem Marek Cygan1 , Marcin Kubica1 , Jakub Radoszewski1 , Wojciech Rytter1,2 and Tomasz Waleń1 1 University 2 Copernicus

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2011-09-23 10:27:49
220Approximation algorithms / Cluster analysis / Combinatorial optimization / NP-complete problems / Complexity classes / Correlation clustering / Consensus clustering / Optimization problem / Minimum k-cut / Theoretical computer science / Computational complexity theory / Statistics

A Polynomial Time Approximation Scheme for k-Consensus Clustering∗ Tom Coleman† Abstract This paper introduces a polynomial time approximation scheme for the metric Correlation Clustering problem, when the number of

Add to Reading List

Source URL: tom.thesnail.org

Language: English - Date: 2015-05-04 03:09:24
UPDATE